Three forbidden subgraphs for line graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Line Graphs and Forbidden Induced Subgraphs

Beineke and Robertson independently characterized line graphs in terms of nine forbidden induced subgraphs. In 1994, S8 olte s gave another characterization, which reduces the number of forbidden induced subgraphs to seven, with only five exceptional cases. A graph is said to be a dumbbell if it consists of two complete graphs sharing exactly one common edge. In this paper, we show that a graph...

متن کامل

Graphs with Forbidden Subgraphs

Many graphs which are encountered in the study of graph theory are characterized by a type of configuration or subgraph they possess. However, there are occasions when such graphs are more easily defined or described by the kind of subgraphs they are not permitted to contain. For example, a tree can be defined as a connected graph which contains no cycles, and Kuratowski [22] characterized plan...

متن کامل

Universal Graphs (with Forbidden Subgraphs)

The graph theoretic problem of identifying the finite sets C of constraint graphs for which there is a countable universal C-free graph is closely related to the problem of determining for which sets C the model companion T ∗ C of the theory of C-free graphs is א0-categorical, and this leads back to combinatorics. Little is known about these theories from any other perspective, such as stabilit...

متن کامل

Forbidden subgraphs in connected graphs

Given a set ξ = {H1,H2, · · ·} of connected non acyclic graphs, a ξ-free graph is one which does not contain any member of ξ as copy. Define the excess of a graph as the difference between its number of edges and its number of vertices. Let Ŵk,ξ be theexponential generating function (EGF for brief) of connected ξ-free graphs of excess equal to k (k ≥ 1). For each fixed ξ, a fundamental differen...

متن کامل

Forbidden induced subgraphs for star-free graphs

Let H be a family of connected graphs. A graph G is said to be H-free if G is H-free for every graph H in H. In [1] it was pointed that there is a family of connected graphs H not containing any induced subgraph of the claw having the property that the set of H-free connected graphs containing a claw is finite, provided also that those graphs have minimum degree at least two and maximum degree ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2002

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(01)00459-9